Workshop on Clustering and Search techniques in large scale networks Hierarchical network clustering by modularity maximization
نویسنده
چکیده
Community detection based on modularity maximization is currently done with hierarchical as well as with partitioning heuristics, and, in a few papers, exact algorithms. Hierarchical heuristics aim at finding a set of nested partitions. They are in principle devised for finding a hierarchy of partitions implicit in the given network when it corresponds to some situation where hierarchy is observed or postulated. This is often the case, for instance, in social organizations and evolutionary processes. We discuss agglomerative and divisive hierarchical heuristics that are based on modularity maximization. We overview some known heuristics and discuss a few examples.
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملComparison and evaluation of network clustering algorithms applied to genetic interaction networks.
The goal of network clustering algorithms detect dense clusters in a network, and provide a first step towards the understanding of large scale biological networks. With numerous recent advances in biotechnologies, large-scale genetic interactions are widely available, but there is a limited understanding of which clustering algorithms may be most effective. In order to address this problem, we...
متن کاملAgglomerative hierarchical kernel spectral clustering for large scale networks
We propose an agglomerative hierarchical kernel spectral clustering (AH-KSC) model for large scale complex networks. The kernel spectral clustering (KSC) method uses a primal-dual framework to build a model on a subgraph of the network. We exploit the structure of the projections in the eigenspace to automatically identify a set of distance thresholds. These thresholds lead to the different lev...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملHierarchical Organization of Modularity in Complex Networks
Many real networks in nature and society share two generic properties: they are scale-free and they display a high degree of clustering. We show that the scalefree nature and high clustering of real networks are the consequence of a hierarchical organization, implying that small groups of nodes form increasingly large groups in a hierarchical manner, while maintaining a scale-free topology. In ...
متن کامل